Computational Diffie–Hellman assumption

Results: 19



#Item
11Public-key cryptography / Finite fields / BLS / Computational Diffie–Hellman assumption / Diffie–Hellman problem / Decisional Diffie–Hellman assumption / Diffie–Hellman key exchange / Zero-knowledge proof / Digital signature / Cryptography / Computational hardness assumptions / Cryptographic protocols

Pairing-Based Identification Schemes

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2008-06-06 19:27:43
12Public-key cryptography / Computational hardness assumptions / BLS / Diffie–Hellman problem / Digital signature / XTR / Parity of a permutation / Diffie–Hellman key exchange / Structure / Cryptography / Finite fields / Cryptographic protocols

Boneh et al.’s k-Element Aggregate Extraction Assumption Is Equivalent to The Diffie-Hellman Assumption Jean-Sebastien Coron and David Naccache Gemplus Card International 34, rue Guynemer, Issy-les-Moulineaux, F-92447,

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2008-09-15 00:54:54
13Decisional Diffie–Hellman assumption / Mathematics / Diffie–Hellman problem / XTR / Diffie–Hellman key exchange / Computational Diffie–Hellman assumption / Computational hardness assumptions / Finite fields / Cryptographic protocols

Advances in Cryptology – Proceedings of Crypto ’07 (August 19–[removed], Santa Barbara, CA) A. Menezes Ed. Springer-Verlag, LNCS 4622, pages 482–499. A generalization of DDH with applications to protocol analysis a

Add to Reading List

Source URL: www.ssi.gouv.fr

Language: English - Date: 2012-11-06 05:29:19
14Pseudorandomness / Computational hardness assumptions / Pseudorandom number generators / Algorithmic information theory / Pseudorandom generator / Naor-Reingold Pseudorandom Function / Decisional Diffie–Hellman assumption / Pseudorandom function family / Randomized algorithm / Cryptography / Theoretical computer science / Applied mathematics

Efficient Pseudorandom Functions From the Decisional Linear Assumption and Weaker Variants Allison B. Lewko ∗ University of Texas at Austin

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2009-10-16 13:57:22
15Finite fields / Cryptographic protocols / Homomorphic encryption / Diffie–Hellman problem / Strong RSA assumption / RSA / Elliptic curve cryptography / Actor model / Eurocrypt / Cryptography / Public-key cryptography / Computational hardness assumptions

Victor Shoup Curriculum Vitae Feb. 6, 2014 Department of Computer Science Courant Institute of Mathematical Sciences New York University 251 Mercer Street

Add to Reading List

Source URL: www.shoup.net

Language: English - Date: 2014-02-06 21:21:47
16Finite fields / Cryptographic protocols / Group signature / Diffie–Hellman key exchange / Digital signature / Computational Diffie–Hellman assumption / ElGamal encryption / Diffie–Hellman problem / Schnorr signature / Cryptography / Computational hardness assumptions / Public-key cryptography

A Practical and Provably Secure Coalition-Resistant Group Signature Scheme Giuseppe Ateniese1 , Jan Camenisch2 , Marc Joye3 , and Gene Tsudik4

Add to Reading List

Source URL: www.zurich.ibm.com

Language: English - Date: 2000-10-24 11:52:18
17Key-agreement protocol / MQV / Public-key cryptography / XTR / Computational Diffie–Hellman assumption / Advantage / Perfect forward secrecy / Diffie–Hellman problem / Ciphertext indistinguishability / Cryptography / Cryptographic protocols / Diffie–Hellman key exchange

Strongly-Secure Identity-based Key Agreement and Anonymous Extension Sherman S.M. Chow1 and Kim-Kwang Raymond Choo2,

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2008-01-03 02:55:34
18Public-key cryptography / Publicly Verifiable Secret Sharing / Finite fields / Verifiable secret sharing / Secret sharing / ElGamal encryption / Diffie–Hellman key exchange / Diffie–Hellman problem / Decisional Diffie–Hellman assumption / Cryptography / Cryptographic protocols / Computational hardness assumptions

In Advances in Cryptology—CRYPTO ’99, Vol[removed]of Lecture Notes in Computer Science, Springer-Verlag, 1999. pp[removed]A Simple Publicly Verifiable Secret Sharing

Add to Reading List

Source URL: www.win.tue.nl

Language: English - Date: 2001-04-03 10:12:09
19Finite fields / Computational Diffie–Hellman assumption / Diffie–Hellman problem / Decisional Diffie–Hellman assumption / Diffie–Hellman key exchange / Hellman / ElGamal encryption / Whitfield Diffie / XDH assumption / Cryptography / Computational hardness assumptions / Cryptographic protocols

Workshop on Selected Areas in Cryptography[removed] – 16 august 2002, St. John’s, Newfoundland, Canada) H. Heys and K. Nyberg Eds. Springer-Verlag, LNCS 2595, pages 325–338

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2007-07-06 16:33:16
UPDATE